Widening basins of attraction of optimal iterative methods
نویسندگان
چکیده
منابع مشابه
Contrasts in the basins of attraction of structurally identical iterative root finding methods
Keywords: Nonlinear equations Iterative methods Order of convergence Basins of attraction a b s t r a c t A numerical comparison is performed between three methods of third order with the same structure, namely BSC, Halley's and Euler–Chebyshev's methods. As the behavior of an iterative method applied to a nonlinear equation can be highly sensitive to the starting points, the numerical comparis...
متن کاملSome Iterative Methods Free from Derivatives and Their Basins of Attraction for Nonlinear Equations
First, we make the Jain’s derivative-free method optimal and subsequently increase its efficiency index from 1.442 to 1.587. Then, a novel three-step computational family of iterative schemes for solving single variable nonlinear equations is given. The schemes are free from derivative calculation per full iteration. The optimal family is constructed by applying the weight function approach alo...
متن کاملPerturbed Basins of Attraction
Let F be an automorphism of C which has an attracting fixed point. It is well known that the basin of attraction is biholomorphically equivalent to C. We will show that the basin of attraction of a sequence of automorphisms f1, f2, . . . is also biholomorphic to C if every fn is a small perturbation of the original map F .
متن کاملBasins of attraction for several optimal fourth order methods for multiple roots
There are very few optimal fourth order methods for solving nonlinear algebraic equations having roots of multiplicity m. Here we compare five such methods, two of which require the evaluation of the (m − 1)st root. The methods are usually compared by evaluating the computational efficiency and the efficiency index. In this paper all the methods have the same efficiency, since they are of the s...
متن کاملIterative Widening
We propose a method to gradually expand the moves to consider at the nodes of game search trees. The algorithm begins with an iterative deepening search using the minimal set of moves, and if the search does not succeed, iteratively widens the set of possible moves, performing a complete iterative deepening search after each widening. When designing carefully the different sets of possible move...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinear Dynamics
سال: 2016
ISSN: 0924-090X,1573-269X
DOI: 10.1007/s11071-016-3089-2